An Improved Bound for k-Sets in Four Dimensions
نویسنده
چکیده
We show that the number of halving sets of a set of n points in R is O ( n ) , improving the previous bound of [9] with a simpler (albeit similar) proof.
منابع مشابه
Some Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملA Study of Precision Forging of Steel Spur Gears: Upper Bound Model and Experiments
Precision forging process is widely used for the production of spur gears due to its advantages such as improved strength and surface finish, little waste of materials and reduction in the machining time of the gear. An important aspect of precision forging process is the load required to perform the process successfully and design the forging tools. In this research, a new kinematically admiss...
متن کاملOn k-Sets in Four Dimensions
We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4−2/45). This improves the previous bound of O(n4−1/13 4 ). Our main new ingredient is a bound on the maximum number of halving simplices intersecting a fixed 2-plane.
متن کاملFinite field Kakeya and Nikodym sets in three dimensions
We give improved lower bounds on the size of Kakeya and Nikodym sets over Fq. We also propose a natural conjecture on the minimum number of points in the union of a not-too-flat set of lines in Fq, and show that this conjecture implies an optimal bound on the size of a Nikodym set. Finally, we study the notion of a weak Nikodym set and give improved, and in some special cases optimal, bounds fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 20 شماره
صفحات -
تاریخ انتشار 2011